Перевод: с английского на все языки

со всех языков на английский

strictly contained in

См. также в других словарях:

  • Strictly Personal — is also a book by W. Somerset Maugham. Infobox Album Name = Strictly Personal Type = Album Artist = Captain Beefheart Released = October 1968 Recorded = Sunset Sound April 25 May 2 1968 Genre = Psychedelic rock, Blues rock Length = 38:54 Label =… …   Wikipedia

  • Strictly Instrumental (album) — Infobox Album Name = Strictly Instrumental Type = studio album Artist = Bill Haley and His Comets Released = December 14, 1959 Recorded = June 3, 1958; January 7, 1959; April 27, 1959; September 17 24, 1959 New York Genre = Rock and Roll Length …   Wikipedia

  • Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

  • Complexity class — In computational complexity theory, a complexity class is a set of problems of related resource based complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by an abstract machine M using… …   Wikipedia

  • Time hierarchy theorem — In computational complexity theory, the time hierarchy theorems are important statements about time bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example …   Wikipedia

  • P (complexity) — In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems which can be solved by a deterministic Turing machine using a polynomial amount of… …   Wikipedia

  • Log-space reduction — In computational complexity theory, a log space reduction is a reduction computable by a deterministic Turing machine using logarithmic space. Conceptually, this means it can keep a constant number of pointers into the input, along with a… …   Wikipedia

  • Commitment ordering — In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; (Raz 1990, 1992, 1994, 2009)) is a class of interoperable Serializability techniques …   Wikipedia

  • PR (complexity) — PR is the complexity class of all primitive recursive functions – or, equivalently, the set of all formal languages that can be decided by such a function. This includes addition, multiplication, exponentiation, tetration, etc.The Ackermann… …   Wikipedia

  • Orbit portrait — In mathematics, an orbit portrait is a combinatorial tool used in complex dynamics for understanding the behavior of one complex dimensional quadratic maps. In simple words one can say that it is : a list of external angles for which rays… …   Wikipedia

  • Tree walking automaton — A tree walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings.The following article deals with tree walking automata. For a different notion of tree automaton, closely related to regular tree… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»